2.4 KB · ⇊ 2 parts · ⤓ Micron 2.4 KB · ⤓ HTML 9.9 KB

top

A comma-free code is block code in which no concatenation of two code words contains a valid code word that overlaps both.cite-ref-society1958-1-0[1]

Comma-free codes are also known as self-synchronizing block codescite-ref-knuthchristmaslecture-2-0[2] because no synchronization is required to find the beginning of a code word.

In the literature, the requirement that all code words have to have the same length is sometimes dropped, resulting in the same class as self-synchronizing codes, see Self-synchronizing code.

• See also

• References

• External links

• Self-synchronizing code

• UTF-8, a comma-free character encoding

cite-note-society1958-11. ↑ citerefs-w-golombgordonl-r-welch1958S. W. Golomb; Gordon, Basil; L. R. Welch (1958). "Comma-free Codes". Canadian Journal of Mathematics. Canadian Mathematical Society: 202–209. doi:10.4153/CJM-1958-023-9.

cite-note-knuthchristmaslecture-22. ↑ Donald Knuth (11 December 2015). Universal Commafree Codes. Stanford University. Retrieved 6 February 2016.

• Donald Knuth's 21st Annual Christmas Lecture: Universal Commafree Codes on YouTube